On decidability of list structures
نویسندگان
چکیده
منابع مشابه
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two steps: first, we reduce the considered problem to the problem of determining, for any Rabin tree automaton, whether it accepts a given tree; then, we exploit a suitable notion of tree equivalence to reduce (a number ...
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولthe effect of consciousness-raising activities on learning grammatical structures by iranian guidance school efl learners
abstract the first purpose of this study was to investigate the effect of consciousness-raising (c-r) activities on learning grammatical structures (simple present tense in this case) by iranian guidance school efl learners. the second one was to investigate the effect of gender on learning the simple present tense through c-r activities and tasks. finally, this study aimed to investigate the ...
Decidability and Invariant Classes for Degree Structures
We present a decision procedure for the V3-theory of 3[0,0'], the Turing degrees below 0'. The two main ingredients are a new extension of embeddings result and a strengthening of the initial segments results below 0' of [Lei]. First, given any finite subuppersemilattice U ot 3[0,0'] with top element 0' and an isomorphism type V of a poset extending U consistently with its structure as an usl s...
متن کاملOrdinal Arithmetic with List Structures
We provide a set of \natural" requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the rst critical epsilon number. The checker has to verify that the process comes to an end. Here again he should be assisted by the programmer giving a further de nite assertion to be veri ed. This may take the form of a quantity which is asserted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sibirskii matematicheskii zhurnal
سال: 2018
ISSN: 0037-4474
DOI: 10.33048/smzh.2019.60.302